Equality In Lazy Computation Systems
نویسنده
چکیده
In this paper we introduce a general class of lazy computation systems and deene a natural program equivalence for them. We prove that if an extensionality condition holds of each of the operators of a computation system, then the equivalence relation is a congruence, so that the usual kinds of equality reasoning are valid for it. This condition is a simple syntactic one, and is easy to verify for the various lazy computation systems we have considered so far. We also give conditions under which the equivalence coincides with observational congruence. These results have some important consequences for type theories like those of Martin-LL of and Nuprl.
منابع مشابه
A Deterministic Lazy Narrowing Calculus
In this paper we study the non-determinism between the inference rules of the lazy narrowing calculus lnc (Middeldorp et al., 1996). We show that all non-determinism can be removed without losing the important completeness property by restricting the underlying term rewriting systems to left-linear confluent constructor systems and interpreting equality as strict equality. For the subclass of o...
متن کاملA Case Study on the Parametric Occurrence of Multiple Steady States
We consider the problem of determining multiple steady states for positive real values in models of biological networks. Investigating the potential for these in models of the mitogen-activated protein kinases (MAPK) network has consumed considerable effort using special insights into the structure of corresponding models. Here we apply combinations of symbolic computation methods for mixed equ...
متن کاملA Complete Axiomatization of Strict Equality over Infinite Trees (Extended Version) Technical Report SIC-03-2009, UCM
Computing with data values that are some kind of trees — finite, infinite, rational— is at the core of declarative programming, either logic, functional or functional-logic. Understanding the logic of trees is therefore a fundamental question with impact in different aspects, like language design, including constraint systems or constructive negation, or obtaining methods for verifying and reas...
متن کاملInduction and Co-induction in Sequent Calculus
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles are based on a proof theoretic notion of definition [26, 9, 13] Definitions are essentially stratified logic programs. The left and right rules for defined ...
متن کاملIntensional equality for process calculi based on ε-structures
The subject of the thesis is firstly to add to the understanding of the notion of intensional equality in process setting which is a complementary notion to the extensional equality and secondly to give an intensional set-theoretic semantics for processes in -structures which allows non-well-founded sets for modelling self-reference. The intensional equality allows to distinguish processes by t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989